<!-- This HTML file has been created by texi2html 1.30
     from ../r4rs.texi on 14 July 1994 -->

<TITLE>Scheme - Bibliography</TITLE>
<P>Go to the <A HREF="r4rs_12.htm">previous</A>, <A HREF="r4rs_14.htm">next</A> section.<P>
<H1><A NAME="SEC86" HREF="r4rs_toc.htm#SEC86">Bibliography</A></H1>
<P>
<DL COMPACT>
<A NAME="IDX747"></A>
<DT><A NAME="BIB1">[ABELSON88]</A>
<DD>Harold Abelson and Gerald Jay Sussman.
Lisp: a langauge for stratified design.
<CITE>BYTE</CITE> 13(2):207--218, February 1988.
<P>
<A NAME="IDX748"></A>
<DT><A NAME="BIB2">[SICP]</A>
<DD>Harold Abelson and Gerald Jay Sussman with Julie Sussman.
<CITE>Structure and Interpretation of Computer Programs.</CITE>
MIT Press, Cambridge, 1985.
<P>
<A NAME="IDX749"></A>
<DT><A NAME="BIB3">[ADAMS88]</A>
<DD>Norman Adams and Jonathan Rees.
Object-oriented programming in Scheme.
In <CITE>Proceedings of the 1988 Conference on Lisp
  and Functional Programming</CITE>, pages 277--288, August 1988.
<P>
<A NAME="IDX750"></A>
<DT><A NAME="BIB4">[BARTLEY86]</A>
<DD>David H. Bartley and John C. Jensen.
The implementation of PC Scheme.
In <CITE>Proceedings of the 1986 ACM Conference on Lisp
  and Functional Programming</CITE>, pages 86--93.
<P>
<A NAME="IDX751"></A>
<DT><A NAME="BIB5">[SCHEME81]</A>
<DD>John Batali, Edmund Goodhue, Chris Hanson, Howie Shrobe, Richard
  M. Stallman, and Gerald Jay Sussman.
The Scheme-81 architecture--system and chip.
In <CITE>Proceedings, Conference on Advanced Research in VLSI</CITE>,
  pages 69--77.
Paul Penfield, Jr., editor.
Artech House, 610 Washington Street, Dedham MA, 1982.
<P>
<A NAME="IDX752"></A>
<DT><A NAME="BIB6">[BAWDEN88]</A>
<DD>Alan Bawden and Jonathan Rees.
Syntactic closures.
In <CITE>Proceedings of the 1988 ACM Symposium on Lisp and
  Functional Programming</CITE>, pages 86--95.
<P>
Available as
<A HREF="ftp://altdorf.ai.mit.edu/pub/scheme-reports/synclo.dvi">
synclo.dvi
</A>,
<A HREF="ftp://altdorf.ai.mit.edu/pub/scheme-reports/synclo.ps">
synclo.ps
</A>,
<A HREF="ftp://altdorf.ai.mit.edu/pub/scheme-reports/synclo.tar">
synclo.tar
</A> or
<A HREF="ftp://altdorf.ai.mit.edu/pub/scheme-reports/synclo.tar.Z">
synclo.tar.Z
</A> (LaTeX files).
<P>
<A NAME="IDX753"></A>
<DT><A NAME="BIB7">[CLINGER84]</A>
<DD>William Clinger.
The Scheme 311 compiler: an exercise in denotational semantics.
In <CITE>Conference Record of the 1984 ACM Symposium on Lisp and
  Functional Programming</CITE>, pages 356--364.
<P>
<A NAME="IDX754"></A>
<DT><A NAME="BIB8">[RRRS]</A>
<DD>William Clinger, editor.
The revised revised report on Scheme, or an uncommon Lisp.
MIT Artificial Intelligence Memo 848, August 1985.
Also published as Computer Science Department Technical Report 174,
  Indiana University, June 1985.
<P>
<A NAME="IDX755"></A>
<DT><A NAME="BIB9">[CLINGER88]</A>
<DD>William Clinger.
Semantics of Scheme.
<CITE>BYTE</CITE> 13(2):221--227, February 1988.
<P>
<A NAME="IDX756"></A>
<DT><A NAME="BIB10">[HOWTOREAD]</A>
<DD>William Clinger.
How to read floating point numbers accurately.
In <CITE>Proceedings of the ACM SIGPLAN '90 Conference
  on Programming Language Design and Implementation</CITE>, pages 92--101.
Proceedings published as <CITE>SIGPLAN Notices</CITE> 25(6), June 1990.
<P>
<A NAME="IDX757"></A>
<DT><A NAME="BIB11">[CLINGER85]</A>
<DD>William Clinger, Daniel P. Friedman, and Mitchell Wand.
A scheme for a higher-level semantic algebra.
In <CITE>Algebraic Methods in Semantics</CITE>, pages 237--250.
J. Reynolds, M. Nivat, editor.
Cambridge University Press, 1985.
<P>
<A NAME="IDX758"></A>
<DT><A NAME="BIB12">[CLINGER88B]</A>
<DD>William Clinger, Anne Hartheimer, and Eric Ost.
Implementation strategies for continuations.
In <CITE>Proceedings of the 1988 ACM Conference on Lisp and Functional
  Programming</CITE>, pages 124--131.
<P>
<A NAME="IDX759"></A>
<DT><A NAME="BIB13">[MACROSTHATWORK]</A>
<DD>William Clinger and Jonathan Rees.
Macros that work.
In <CITE>Proceedings of the 1991 ACM Conference on Principles of
  Programming Languages</CITE>, pages 155--162.
<P>
<A NAME="IDX760"></A>
<DT><A NAME="BIB14">[CURTIS90]</A>
<DD>Pavel Curtis and James Rauen.
A module system for Scheme.
In <CITE>Proceedings of the 1990 ACM Conference on Lisp and
  Functional Programming</CITE>, June 1990.
<P>
<A NAME="IDX761"></A>
<DT><A NAME="BIB15">[DYBVIG87]</A>
<DD>R. Kent Dybvig.
<CITE>The Scheme Programming Language.</CITE>
Prentice-Hall, 1987.
<A NAME="IDX762"></A>
<P>
<A NAME="IDX763"></A>
<DT><A NAME="BIB16">[DYBVIG86]</A>
<DD>R. Kent Dybvig and Daniel P. Friedman and Christopher T. Haynes.
Expansion-passing style: a general macro mechanism.
<CITE>Lisp and Symbolic Computation</CITE> 1(1):53--76, June 1988.
<P>
<A NAME="IDX764"></A>
<DT><A NAME="BIB17">[DYBVIG88]</A>
<DD>R. Kent Dybvig and Robert Hieb.
A variable-arity procedural interface.
In <CITE>Proceedings of the 1988 ACM Symposium on Lisp and
  Functional Programming</CITE>, pages 106--115.
<P>
<A NAME="IDX765"></A>
<DT><A NAME="BIB18">[DYBVIG88]</A>
<DD>R. Kent Dybvig and Robert Hieb.
Engines from continuations.
<CITE>Journal of Computer Languages</CITE> 14(2), pages 109--123,
1989.
<P>
<A NAME="IDX766"></A>
<DT><A NAME="BIB19">[DYBVIG88]</A>
<DD>R. Kent Dybvig and Robert Hieb.
Continuations and concurrency.
In <CITE>Proceedings of the Second ACM SIGPLAN Notices
  Symposium on Principles and Practice of Parallel Programming</CITE>,
pages 128--136, March 1990.
<P>
<A NAME="IDX767"></A>
<DT><A NAME="BIB20">[EISENBERG85]</A>
<DD>Michael A. Eisenberg.
Bochser: an integrated Scheme programming system.
MIT Laboratory for Computer Science Technical Report 349,
  October 1985.
<P>
<A NAME="IDX768"></A>
<DT><A NAME="BIB21">[EISENBERG88]</A>
<DD>Michael Eisenberg.
Harold Abelson, editor.
<CITE>Programming In Scheme.</CITE>
Scientific Press, Redwood City, California, 1988.
<P>
<A NAME="IDX769"></A>
<DT><A NAME="BIB22">[EISENBERG90]</A>
<DD>Michael Eisenberg, with William Clinger and Anne Hartheimer.
Harold Abelson, editor.
<CITE>Programming In MacScheme.</CITE>
Scientific Press, San Francisco, 1990.
<P>
<A NAME="IDX770"></A>
<DT><A NAME="BIB23">[FEELEY86]</A>
<DD>Marc Feeley.
Deux approches `{a} l'implantation du language Scheme.
M.Sc. thesis, D'{e}partement d'Informatique et de Recherche
  Op'{e}rationelle, University of Montreal, May 1986.
<P>
<A NAME="IDX771"></A>
<DT><A NAME="BIB24">[FEELEY87]</A>
<DD>Marc Feeley and Guy LaPalme.
Using closures for code generation.
<CITE>Journal of Computer Languages</CITE> 12(1):47--66, 1987.
<P>
<A NAME="IDX772"></A>
<DT><A NAME="BIB25">[FEELEY90]</A>
<DD>Marc Feeley and James Miller.
A parallel virtual machine for efficient Scheme compilation.
In <CITE>Proceedings of the 1990 ACM Conference on Lisp and
  Functional Programming</CITE>, June 1990.
<P>
<A NAME="IDX773"></A>
<DT><A NAME="BIB26">[FELLEISEN87B]</A>
<DD>Matthias Felleisen.
Reflections on Landin's J-Operator: a partly historical note.
<CITE>Journal of Computer Languages</CITE> 12(3/4):197--207, 1987.
<P>
<A NAME="IDX774"></A>
<DT><A NAME="BIB27">[FELLEISEN86B]</A>
<DD>Matthias Felleisen and Daniel P. Friedman.
Control operators, the SECD-machine, and the lambda-calculus.
In <CITE>3rd Working Conference on the Formal Description of
   Programming Concepts</CITE>, pages 193--219, August 1986.
<P>
<A NAME="IDX775"></A>
<DT><A NAME="BIB28">[FELLEISEN86C]</A>
<DD>Matthias Felleisen and Daniel P. Friedman.
A closer look at export and import statements.
<CITE>Journal of Computer Languages</CITE> 11(1):29--37, 1986.
<P>
<A NAME="IDX776"></A>
<DT><A NAME="BIB29">[FELLEISEN87]</A>
<DD>Matthias Felleisen and Daniel P. Friedman.
A calculus for assignments in higher-order languages.
In <CITE>Conference Record of the 14th Annual ACM Symposium
  on Principles of Programming Languages</CITE>, pages 314--345, January 1987.
<P>
<A NAME="IDX777"></A>
<DT><A NAME="BIB30">[FELLEISEN87D]</A>
<DD>Matthias Felleisen and Daniel P. Friedman.
A reduction semantics for imperative higher-order languages.
In <CITE>Lecture Notes in Computer Science</CITE>,
<CITE>Parallel Architectures and Languages Europe</CITE> 259:206--223, 1987.
De Bakker, Nijman and Treleaven, editors.
Springer-Verlag, Berlin.
<P>
<A NAME="IDX778"></A>
<DT><A NAME="BIB31">[FELLEISEN86]</A>
<DD>Matthias Felleisen, Daniel P. Friedman, Eugene Kohlbecker, and Bruce Duba.
Reasoning with continuations.
In <CITE>Proceedings of the Symposium on Logic in Computer Science</CITE>,
  pages 131--141.
IEEE Computer Society Press, Washington DC, 1986.
<P>
<A NAME="IDX779"></A>
<DT><A NAME="BIB32">[FELLEISEN87C]</A>
<DD>Matthias Felleisen, Daniel P. Friedman, Eugene E. Kohlbecker, and Bruce Duba.
A syntactic theory of sequential control.
<CITE>Theoretical Computer Science</CITE> 52:205--237, 1987.
<P>
<A NAME="IDX780"></A>
<DT><A NAME="BIB33">[FELLEISEN88]</A>
<DD>Matthias Felleisen, Mitchell Wand, Daniel P. Friedman, and Bruce Duba.
Abstract continuations: a mathematical semantics for
  handling functional jumps.
In <CITE>Proceedings of the 1988 ACM Symposium on Lisp and
  Functional Programming</CITE>, July 1988.
<P>
<A NAME="IDX781"></A>
<DT><A NAME="BIB34">[SCHEME311]</A>
<DD>Carol Fessenden, William Clinger, Daniel P. Friedman, and Christopher Haynes.
Scheme 311 version 4 reference manual.
Indiana University Computer Science Technical Report 137, February 1983.
Superseded by [SCHEME84].
<P>
<A NAME="IDX782"></A>
<DT><A NAME="BIB35">[FRANCO90]</A>
<DD>John Franco and Daniel P. Friedman.
Towards a facility for lexically scoped, dynamic mutual recursion
  in Scheme.
<CITE>Journal of Computer Languages</CITE> 15(1):55--64, 1990.
<P>
<A NAME="IDX783"></A>
<DT><A NAME="BIB36">[LISPER]</A>
<DD>Daniel P. Friedman and Matthias Felleisen.
<CITE>The Little LISPer.</CITE>
Science Research Associates, second edition 1986.
<P>
<A NAME="IDX784"></A>
<DT><A NAME="BIB37">[LITTLELISPER]</A>
<DD>Daniel P. Friedman and Matthias Felleisen.
<CITE>The Little LISPer.</CITE>
MIT Press, 1987.
<P>
<A NAME="IDX785"></A>
<DT><A NAME="BIB38">[FRIEDMAN85]</A>
<DD>Daniel P. Friedman and Christopher T. Haynes.
Constraining control.
In <CITE>Proceedings of the Twelfth Annual Symposium on Principles of
  Programming Languages</CITE>, pages 245--254.
ACM, January 1985.
<P>
<A NAME="IDX786"></A>
<DT><A NAME="BIB39">[FRIEDMAN84]</A>
<DD>Daniel P. Friedman, Christopher T. Haynes, and Eugene Kohlbecker.
Programming with continuations.
In <CITE>Program Transformation and Programming Environments,</CITE>
  pages 263--274.
P. Pepper, editor.
Springer-Verlag, 1984.
<P>
<A NAME="IDX787"></A>
<DT><A NAME="BIB40">[SCHEME84]</A>
<DD>D. Friedman, C. Haynes, E. Kohlbecker, and M. Wand.
Scheme 84 interim reference manual.
Indiana University Computer Science Technical Report 153, January 1985.
<P>
<A NAME="IDX788"></A>
<DT><A NAME="BIB41">[FRIEDMAN84B]</A>
<DD>Daniel P. Friedman and Mitchell Wand.
Reification: reflection without metaphysics.
In <CITE>Conference Record of the 1984 ACM Symposium on Lisp
  and Functional Programming</CITE>, pages 348--355.
<P>
<A NAME="IDX789"></A>
<DT><A NAME="BIB42">[HAYNES86]</A>
<DD>Christopher T. Haynes.
Logic continuations.
In <CITE>Proceedings of the Third International Conference on
  Logic Programming,</CITE> pages 671--685.
Springer-Verlag, July 1986.
<P>
<A NAME="IDX790"></A>
<DT><A NAME="BIB43">[ENGINES]</A>
<DD>Christopher T. Haynes and Daniel P. Friedman.
Engines build process abstractions.
In <CITE>Conference Record of the 1984 ACM Symposium on Lisp and
  Functional Programming,</CITE> pages 18--24.
<P>
<A NAME="IDX791"></A>
<DT><A NAME="BIB44">[HAYNES87B]</A>
<DD>Christopher T. Haynes and Daniel P. Friedman.
Abstracting timed preemption with engines.
<CITE>Journal of Computer Languages</CITE> 12(2):109--121, 1987.
<P>
<A NAME="IDX792"></A>
<DT><A NAME="BIB45">[HAYNES87A]</A>
<DD>Christopher T. Haynes and Daniel P. Friedman.
Embedding continuations in procedural objects.
<CITE>ACM Transactions on Programming Languages and Systems</CITE> 9(4):582--598,
  October 1987.
<A NAME="IDX793"></A>
<P>
<A NAME="IDX794"></A>
<DT><A NAME="BIB46">[HAYNES86]</A>
<DD>Christopher T. Haynes and Daniel P. Friedman and Mitchell Wand.
Obtaining coroutines with continuations.
<CITE>Journal of Computer Languages</CITE> 11(3/4):143--153, 1986.
<P>
<A NAME="IDX795"></A>
<DT><A NAME="BIB47">[HENDERSON82]</A>
<DD>Peter Henderson.
Functional geometry.
In <CITE>Conference Record of the 1982 ACM Symposium on Lisp and
  Functional Programming</CITE>, pages 179--187.
<P>
<A NAME="IDX796"></A>
<DT><A NAME="BIB48">[DYBVIG88]</A>
<DD>Robert Hieb, R. Kent Dybvig, and Carl Bruggeman.
Representing control in the presence of first-class continuations.
In <CITE>Proceedings of the ACM SIGPLAN '90 Conference on Programming
  Language Design and Implementation</CITE>,
pages 66--77, June 1990.
Proceedings published as <CITE>SIGPLAN Notices</CITE> 25(6), June 1990.
<P>
<A NAME="IDX797"></A>
<DT><A NAME="BIB49">[IEEE]</A>
<DD><CITE>IEEE Standard 754-1985.  IEEE Standard for Binary Floating-Point
Arithmetic.</CITE>  IEEE, New York, 1985.
<P>
<A NAME="IDX798"></A>
<DT><A NAME="BIB50">[IEEESCHEME]</A>
<DD><CITE>IEEE Standard 1178-1990.  IEEE Standard for the Scheme
  Programming Language.</CITE>  IEEE, New York, 1991.
<P>
<A NAME="IDX799"></A>
<DT><A NAME="BIB51">[KOHLBECKER86]</A>
<DD>Eugene Edmund Kohlbecker Jr.
<CITE>Syntactic Extensions in the Programming Language Lisp.</CITE>
PhD thesis, Indiana University, August 1986.
<P>
<A NAME="IDX800"></A>
<DT><A NAME="BIB52">[HYGIENIC]</A>
<DD>Eugene E. Kohlbecker, Daniel P. Friedman, Matthias Felleisen, and Bruce Duba.
Hygienic macro expansion.
In <CITE>Proceedings of the 1986 ACM Conference on Lisp
  and Functional Programming</CITE>, pages 151--161.
<P>
<A NAME="IDX801"></A>
<DT><A NAME="BIB53">[KRANZ86]</A>
<DD>David Kranz, Richard Kelsey, Jonathan Rees, Paul Hudak, James Philbin,
  and Norman Adams.
Orbit: An optimizing compiler for Scheme.
In <CITE>Proceedings of the SIGPLAN '86 Symposium on Compiler
  Construction</CITE>, pages 219--233.
ACM, June 1986.
Proceedings published as <CITE>SIGPLAN Notices</CITE> 21(7), July 1986.
<P>
<A NAME="IDX802"></A>
<DT><A NAME="BIB54">[KRANZ88]</A>
<DD>David Kranz.
<CITE>Orbit: An optimizing compiler for Scheme.</CITE>
PhD thesis, Yale University, 1988.
<P>
<A NAME="IDX803"></A>
<DT><A NAME="BIB55">[LANDIN65]</A>
<DD>Peter Landin.
A correspondence between Algol 60 and Church's lambda notation: Part I.
<CITE>Communications of the ACM</CITE> 8(2):89--101, February 1965.
<P>
<A NAME="IDX804"></A>
<DT><A NAME="BIB56">[MCDERMOTT80]</A>
<DD>Drew McDermott.
An efficient environment allocation scheme in an interpreter for a
  lexically-scoped lisp.
In <CITE>Conference Record of the 1980 Lisp Conference,</CITE> pages
  154--162.
Proceedings reprinted by ACM.
<P>
<A NAME="IDX805"></A>
<DT><A NAME="BIB57">[MITSCHEME]</A>
<DD>MIT Department of Electrical Engineering and Computer Science.
Scheme manual, seventh edition.
September 1984.
<P>
<A NAME="IDX806"></A>
<DT><A NAME="BIB58">[MUCHNICK80]</A>
<DD>Steven S. Muchnick and Uwe F. Pleban.
A semantic comparison of Lisp and Scheme.
In <CITE>Conference Record of the 1980 Lisp Conference</CITE>, pages 56--64.
Proceedings reprinted by ACM.
<P>
<A NAME="IDX807"></A>
<DT><A NAME="BIB59">[NAUR63]</A>
<DD>Peter Naur et al.
Revised report on the algorithmic language Algol 60.
<CITE>Communications of the ACM</CITE> 6(1):1--17, January 1963.
<P>
<A NAME="IDX808"></A>
<DT><A NAME="BIB60">[PENFIELD81]</A>
<DD>Paul Penfield, Jr.
Principal values and branch cuts in complex APL.
In <CITE>APL '81 Conference Proceedings,</CITE> pages 248--256.
ACM SIGAPL, San Francisco, September 1981.
Proceedings published as <CITE>APL Quote Quad</CITE> 12(1), ACM, September 1981.
<P>
<A NAME="IDX809"></A>
<DT><A NAME="BIB61">[PITMAN85]</A>
<DD>Kent M. Pitman.
Exceptional situations in Lisp.
MIT Artificial Intelligence Laboratory Working Paper 268, February 1985.
<P>
<A NAME="IDX810"></A>
<DT><A NAME="BIB62">[PITMAN83]</A>
<DD>Kent M. Pitman.
The revised MacLisp manual (Saturday evening edition).
MIT Laboratory for Computer Science Technical Report 295, May 1983.
<P>
<A NAME="IDX811"></A>
<DT><A NAME="BIB63">[PITMAN80]</A>
<DD>Kent M. Pitman.
Special forms in Lisp.
In <CITE>Conference Record of the 1980 Lisp Conference</CITE>, pages 179--187.
Proceedings reprinted by ACM.
<P>
<A NAME="IDX812"></A>
<DT><A NAME="BIB64">[PLEBANTHESIS]</A>
<DD>Uwe F. Pleban.
<CITE>A Denotational Approach to Flow Analysis and Optimization of Scheme,
A Dialect of Lisp.</CITE> PhD thesis, University of Kansas, 1980.
<P>
<A NAME="IDX813"></A>
<DT><A NAME="BIB65">[REES89]</A>
<DD>Jonathan A. Rees.
<CITE>Modular Macros</CITE>.
M.S. thesis, MIT, May 1989.
<P>
<A NAME="IDX814"></A>
<DT><A NAME="BIB66">[REES82]</A>
<DD>Jonathan A. Rees and Norman I. Adams IV.
T: A dialect of Lisp or, lambda: The ultimate software tool.
In <CITE>Conference Record of the 1982 ACM Symposium on Lisp and
  Functional Programming</CITE>, pages 114--122.
<P>
<A NAME="IDX815"></A>
<DT><A NAME="BIB67">[REES84]</A>
<DD>Jonathan A. Rees, Norman I. Adams IV, and James R. Meehan.
The T manual, fourth edition.
Yale University Computer Science Department, January 1984.
<P>
<A NAME="IDX816"></A>
<DT><A NAME="BIB68">[R3RS]</A>
<DD>Jonathan Rees and William Clinger, editors.
The revised(3) report on the algorithmic language Scheme.
In <CITE>ACM SIGPLAN Notices</CITE> 21(12), pages 37--79, December 1986.
<P>
Available as
<A HREF="ftp://altdorf.ai.mit.edu/pub/scheme-reports/r3rs.tar">
r3rs.tar
</A> (LaTeX files).
<P>
<A NAME="IDX817"></A>
<DT><A NAME="BIB69">[R4RS]</A>
<DD>William Clinger and Jonathan Rees, Editors.
Revised(4) Report on the Algorithmic Language Scheme.
In <CITE>ACM Lisp Pointers IV</CITE> (July-September 1991).
<P>
Available as
<A HREF="ftp://altdorf.ai.mit.edu/pub/scheme-reports/r4rs.dvi">
r4rs.dvi
</A>,
<A HREF="ftp://altdorf.ai.mit.edu/pub/scheme-reports/r4rs.dvi.Z">
r4rs.dvi.Z
</A>,
<A HREF="ftp://altdorf.ai.mit.edu/pub/scheme-reports/r4rs.ps">
r4rs.ps
</A>,
<A HREF="ftp://altdorf.ai.mit.edu/pub/scheme-reports/r4rs.ps.Z">
r4rs.ps.Z
</A>, or
<A HREF="ftp://altdorf.ai.mit.edu/pub/scheme-reports/r4rs.tar">
r4rs.tar
</A> or
<A HREF="ftp://altdorf.ai.mit.edu/pub/scheme-reports/r4rs.tar.Z">
r4rs.tar.Z
</A> (LaTeX files).
<P>
<A NAME="IDX818"></A>
<DT><A NAME="BIB70">[REYNOLDS72]</A>
<DD>John Reynolds.
Definitional interpreters for higher order programming languages.
In <CITE>ACM Conference Proceedings</CITE>, pages 717--740.
ACM,
 1972.
<P>
<A NAME="IDX819"></A>
<DT><A NAME="BIB71">[ROZAS84]</A>
<DD>Guillermo J. Rozas.
Liar, an Algol-like compiler for Scheme.
S. B. thesis, MIT Department of Electrical Engineering and Computer
  Science, January 1984.
<P>
<A NAME="IDX820"></A>
<DT><A NAME="BIB72">[SCHFLOW]</A>
<DD>Olin Shivers.
Control flow analysis in Scheme.
<CITE>Proceedings of the SIGPLAN 1988 Conference on
  Programming Language Design and Implementation</CITE>, pages 164--174.
Proceedings published as <CITE>SIGPLAN Notices</CITE> 23(7), July 1988.
<P>
<A NAME="IDX821"></A>
<DT><A NAME="BIB73">[SITARAM90]</A>
<DD>Dorai Sitaram and Matthias Felleisen.
Control delimiters and their hierarchies.
<CITE>Lisp and Symbolic Computation</CITE> 3(1):67--99, January 1990.
<P>
<A NAME="IDX822"></A>
<DT><A NAME="BIB74">[SMITH84]</A>
<DD>Brian C. Smith.
Reflection and semantics in a procedural language.
MIT Laboratory for Computer Science Technical Report 272, January 1982.
<P>
<A NAME="IDX823"></A>
<DT><A NAME="BIB75">[SPRINGER89]</A>
<DD>George Springer and Daniel P. Friedman.
<CITE>Scheme and the Art of Programming.</CITE>
MIT Press and McGraw-Hill, 1989.
<P>
<A NAME="IDX824"></A>
<DT><A NAME="BIB76">[SRIVASTAVA85]</A>
<DD>Amitabh Srivastava, Don Oxley, and Aditya Srivastava.
An(other) integration of logic and functional programming.
In <CITE>Proceedings of the Symposium on Logic Programming</CITE>, pages 254--260.
IEEE, 1985.
<P>
<A NAME="IDX825"></A>
<DT><A NAME="BIB77">[STALLMAN80]</A>
<DD>Richard M. Stallman.
Phantom stacks--if you look too hard, they aren't there.
MIT Artificial Intelligence Memo 556, July 1980.
<P>
<A NAME="IDX826"></A>
<DT><A NAME="BIB78">[DECLARATIVE]</A>
<DD>Guy Lewis Steele Jr.
Lambda, the ultimate declarative.
MIT Artificial Intelligence Memo 379, November 1976.
<P>
<A NAME="IDX827"></A>
<DT><A NAME="BIB79">[DEBUNKING]</A>
<DD>Guy Lewis Steele Jr.
Debunking the "expensive procedure call" myth, or procedure call
  implementations considered harmful, or lambda, the ultimate GOTO.
In <CITE>ACM Conference Proceedings</CITE>, pages 153--162.
ACM, 1977.
<P>
<A NAME="IDX828"></A>
<DT><A NAME="BIB80">[MACARONI]</A>
<DD>Guy Lewis Steele Jr.
Macaroni is better than spaghetti.
In <CITE>Proceedings of the Symposium on Artificial Intelligence and
  Programming Languages</CITE>, pages 60--66.
These proceedings were published as a special joint issue of
  <CITE>SIGPLAN Notices</CITE> 12(8) and <CITE>SIGART Newsletter</CITE> 64, August
  1977.
<P>
<A NAME="IDX829"></A>
<DT><A NAME="BIB81">[RABBIT]</A>
<DD>Guy Lewis Steele Jr.
Rabbit: a compiler for Scheme.
MIT Artificial Intelligence Laboratory Technical Report 474, May 1978.
<P>
<A NAME="IDX830"></A>
<DT><A NAME="BIB82">[RENAMEGOTO]</A>
<DD>Guy Lewis Steele Jr.
Compiler optimization based on viewing LAMBDA as RENAME + GOTO.
In <CITE>AI: An MIT Perspective.</CITE>
Patrick Henry Winston Richard Henry Brown, editor.
MIT Press, 1980.
<P>
<A NAME="IDX831"></A>
<DT><A NAME="BIB83">[CLOVERVIEW]</A>
<DD>Guy Lewis Steele Jr.
An overview of Common Lisp.
In <CITE>Conference Record of the 1982 ACM Symposium on Lisp and
  Functional Programming</CITE>, pages 98--107.
<P>
<A NAME="IDX832"></A>
<DT><A NAME="BIB84">[CLTL]</A>
<DD>Guy Lewis Steele Jr.
<CITE>Common Lisp: The Language.</CITE>
Digital Press, Burlington MA, 1984.
<P>
<A NAME="IDX833"></A>
<DT><A NAME="BIB85">[IMPERATIVE]</A>
<DD>Guy Lewis Steele Jr. and Gerald Jay Sussman.
Lambda, the ultimate imperative.
MIT Artificial Intelligence Memo 353, March 1976.
<P>
<A NAME="IDX834"></A>
<DT><A NAME="BIB86">[SCHEME78]</A>
<DD>Guy Lewis Steele Jr. and Gerald Jay Sussman.
The revised report on Scheme, a dialect of Lisp.
MIT Artificial Intelligence Memo 452, January 1978.
<P>
<A NAME="IDX835"></A>
<DT><A NAME="BIB87">[TAOTI]</A>
<DD>Guy Lewis Steele Jr. and Gerald Jay Sussman.
The art of the interpreter, or the modularity complex (parts zero, one,
  and two).
MIT Artificial Intelligence Memo 453, May 1978.
<P>
<A NAME="IDX836"></A>
<DT><A NAME="BIB88">[DOALBP]</A>
<DD>Guy Lewis Steele Jr. and Gerald Jay Sussman.
Design of a Lisp-based processor.
<CITE>Communications of the ACM</CITE> 23(11):628--645, November 1980.
<P>
<A NAME="IDX837"></A>
<DT><A NAME="BIB89">[DREAM]</A>
<DD>Guy Lewis Steele Jr. and Gerald Jay Sussman.
The dream of a lifetime: a lazy variable extent mechanism.
In <CITE>Conference Record of the 1980 Lisp Conference</CITE>, pages 163--172.
Proceedings reprinted by ACM.
<P>
<A NAME="IDX838"></A>
<DT><A NAME="BIB90">[HOWTOPRINT]</A>
<DD>Guy Lewis Steele Jr. and Jon L White.
How to print floating point numbers accurately.
In <CITE>Proceedings of the ACM SIGPLAN '90 Conference
  on Programming Language Design and Implementation</CITE>, pages 112--126.
Proceedings published as <CITE>SIGPLAN Notices</CITE> 25(6), June 1990.
<P>
<A NAME="IDX839"></A>
<DT><A NAME="BIB91">[SUSSMAN82]</A>
<DD>Gerald Jay Sussman.
Lisp, programming and implementation.
In <CITE>Functional Programming and its Applications.</CITE>
Darlington, Henderson, Turner, editor.
Cambridge University Press, 1982.
<P>
<A NAME="IDX840"></A>
<DT><A NAME="BIB92">[SCHEME75]</A>
<DD>Gerald Jay Sussman and Guy Lewis Steele Jr.
Scheme: an interpreter for extended lambda calculus.
MIT Artificial Intelligence Memo 349, December 1975.
<P>
<A NAME="IDX841"></A>
<DT><A NAME="BIB93">[SCHEME79]</A>
<DD>Gerald Jay Sussman, Jack Holloway, Guy Lewis Steele Jr., and Alan Bell.
Scheme-79--Lisp on a chip.
<CITE>IEEE Computer</CITE> 14(7):10--21, July 1981.
<P>
<A NAME="IDX842"></A>
<DT><A NAME="BIB94">[STOY77]</A>
<DD>Joseph E. Stoy.
<CITE>Denotational Semantics: The Scott-Strachey Approach to
  Programming Language Theory.</CITE>
MIT Press, Cambridge, 1977.
<P>
<A NAME="IDX843"></A>
<DT><A NAME="BIB95">[TI85]</A>
<DD>Texas Instruments, Inc.
<CITE>TI Scheme Language Reference Manual.</CITE>
Preliminary version 1.0, November 1985.
<P>
<A NAME="IDX844"></A>
<DT><A NAME="BIB96">[VEGDAHL89]</A>
<DD>Steven R. Vegdahl and Uwe F. Pleban.
The runtime environment for Screme, a Scheme implementation on the 88000.
In <CITE>Proceedings of the Third International Conference on Architectural
  Support for Programming Languages and Operating Systems</CITE>,
  pages 172--182, April 1989.
<P>
<A NAME="IDX845"></A>
<DT><A NAME="BIB97">[WAND78]</A>
<DD>Mitchell Wand.
Continuation-based program transformation strategies.
<CITE>Journal of the ACM</CITE> 27(1):174--180, 1978.
<P>
<A NAME="IDX846"></A>
<DT><A NAME="BIB98">[WAND80]</A>
<DD>Mitchell Wand.
Continuation-based multiprocessing.
In <CITE>Conference Record of the 1980 Lisp Conference</CITE>, pages 19--28.
Proceedings available from ACM.
<P>
<A NAME="IDX847"></A>
<DT><A NAME="BIB99">[WAND86]</A>
<DD>Mitchell Wand.
<CITE>Finding the source of type errors.</CITE>
In <CITE>Conference Record of the Thirteenth Annual Symposium on
  Principles of Programming Languages</CITE>, pages 38--43, 1986.
<P>
<A NAME="IDX848"></A>
<DT><A NAME="BIB100">[TOWER]</A>
<DD>Mitchell Wand.
The mystery of the tower revealed: a non-reflective description of the reflective tower.
In <CITE>Proceedings of the 1986 ACM Symposium on LISP and Functional
  Programming</CITE>, pages 298--307, August 1986.
<P>
<A NAME="IDX849"></A>
<DT><A NAME="BIB101">[WAND78]</A>
<DD>Mitchell Wand and Daniel P. Friedman.
Compiling lambda expressions using continuations and factorizations.
<CITE>Journal of Computer Languages</CITE> 3:241--263, 1978.
<P>
<A NAME="IDX850"></A>
<DT><A NAME="BIB102">[WAND88]</A>
<DD>Mitchell Wand and Daniel P. Friedman.
The mystery of the tower revealed: a non-reflective description of the
  reflective tower.
In <CITE>Meta-Level Architectures and Reflection</CITE>, pages 111--134.
P. Maes and D. Nardi, editor.
Elsevier Sci. Publishers B.V. (North Holland), 1988.
<P>
</DL>
<P>
<P>Go to the <A HREF="r4rs_12.htm">previous</A>, <A HREF="r4rs_14.htm">next</A> section.<P>
&nbsp;<p>&nbsp;<p>&nbsp;<p>&nbsp;<p>&nbsp;<p>&nbsp;<p>&nbsp;<p>&nbsp;<p>&nbsp;<p>&nbsp;<p>&nbsp;<p>&nbsp;<p>&nbsp;<p>&nbsp;<p>&nbsp;<p>&nbsp;<p>&nbsp;<p>&nbsp;<p>&nbsp;<p>&nbsp;<p>&nbsp;<p>&nbsp;<p>&nbsp;<p>&nbsp;<p>&nbsp;<p>